The time-precision tradeoff problem on on-line probabilistic Turing machines
نویسندگان
چکیده
منابع مشابه
On the Power of Real { Time Turing Machines : k
We show that, for any integer k, there is at least one language which is accepted by a k-tape real{time Turing machine, but cannot be accepted by a (k 1)-tape real{time Turing machine. We show therefore that the languages accepted by real{time Turing machines form an in nite hierarchy with respect to the number of tapes used.
متن کاملSimulating Turing machines on Maurer machines
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to simulate Turing machines on a Maurer machine which, dissenting from the classical theory of computabi...
متن کاملA Busy Beaver Problem for Infinite-Time Turing Machines
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning the growth rate of an associated function. In our view, these results indicate that the generalization is both natural and promising.
متن کاملThe Transitivity Problem of Turing Machines
A Turing machine is topologically transitive if every partial configuration — that is a state, a head position, plus a finite portion of the tape — can reach any other partial configuration, provided that it is completed into a proper configuration. We characterize topological transitivity and study its computational complexity in the dynamical system models of Turing machines with moving head,...
متن کاملA Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of strings is in this class if and only if there is a formula of the form ∃f1· · ∃fk∃R1· · ∃Rm∀xφ that is true exactly for all strings in L. In this formula the fi are unary function symbols, the Ri are unary relation symbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90133-0